On approximating multicriteria TSP
نویسندگان
چکیده
منابع مشابه
On Approximating Asymmetric TSP and Related Problems
In this thesis we study problems related to approximation of asymmetric TSP. First we give worst case examples for the famous algorithm due to Frieze, Gabiati and Maffioli for asymmetric TSP with triangle inequality. Some steps in the algorithm consist of arbitrary choices. To prove lower bounds, these choices need to be specified. We show a worst case performance with some deterministic assump...
متن کاملOn Approximating the TSP with Intersecting Neighborhoods
In the TSP with neighborhoods problem we are given a set of n regions (neighborhoods) in the plane, and seek to find a minimum length TSP tour that goes through all the regions. We give two approximation algorithms for the case when the regions are allowed to intersect: We give the first O(1)-factor approximation algorithm for intersecting convex fat objects of comparable diameters where we are...
متن کاملA On Approximating Multi-Criteria TSP
We present approximation algorithms for almost all variants of the multi-criteria traveling salesman problem (TSP). First, we devise randomized approximation algorithms for multi-criteria maximum traveling salesman problems (Max-TSP). For multi-criteria Max-STSP, where the edge weights have to be symmetric, we devise an algorithm with an approximation ratio of 2/3 − ε. For multi-criteria Max-AT...
متن کاملApproximating Multi-criteria Max-TSP
The traveling salesman problem (TSP) is one of the most fundamental problems in combinatorial optimization. Given a graph, the goal is to find a Hamiltonian cycle of minimum or maximum weight. We consider finding Hamiltonian cycles of maximum weight (Max-TSP). An instance of Max-TSP is a complete graph G = (V,E) with edge weights w : E → N. The goal is to find a Hamiltonian cycle of maximum wei...
متن کاملApproximating Asymmetric TSP in exponential Time
Let G be a complete directed graph with n vertices and integer edge weights in range [0,M ]. It is well known that an optimal Traveling Salesman Problem (TSP) in G can be solved in 2 time and space (all bounds are given within a polynomial factor of the input length, i.e., poly(n, logM)) and this is still the fastest known algorithm. If we allow a polynomial space only, then the best known algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2012
ISSN: 1549-6325,1549-6333
DOI: 10.1145/2151171.2151180